Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
نویسندگان
چکیده
منابع مشابه
A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
We present a fast and numerically stable algorithm for computing the eigendecom-position of a symmetric block diagonal plus semiseparable matrix. We report numerical experiments that indicate that our algorithm is signiicantly faster than the standard method which treats the given matrix as a general symmetric dense matrix.
متن کاملHomotopy algorithm for the symmetric diagonal-plus-semiseparable eigenvalue problem
A dense symmetric matrix can be reduced into a similar diagonalplus-semiseparable one by means of orthogonal similarity transformations. This makes such a diagonal-plus-semiseparable representation a good alternative to the tridiagonal one when solving dense linear algebra problems. For symmetric tridiagonal matrices there have been developed different homotopy eigensolvers. We present a homoto...
متن کاملA Levinson-like algorithm for symmetric positive definite semiseparable plus diagonal matrices
In this paper a Levinson-like algorithm is derived for solving symmetric positive definite semiseparable plus diagonal systems of equations. In a first part we solve a Yule-Walker-like system of equations. Based on this O(n) solver an algorithm for a general right-hand side is derived. The new method has a linear complexity and takes 19n − 13 operations. The relation between the algorithm and a...
متن کاملComputing the Condition Number of Tridiagonal and Diagonal-Plus-Semiseparable Matrices in Linear Time
For an n × n tridiagonal matrix we exploit the structure of its QR factorization to devise two new algorithms for computing the 1-norm condition number in O(n) operations. The algorithms avoid underflow and overflow, and are simpler than existing algorithms since tests are not required for degenerate cases. An error analysis of the first algorithm is given, while the second algorithm is shown t...
متن کاملA new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
This paper proposes a new type of iteration based on a structured rank factorization for computing eigenvalues of semiseparable and semiseparable plus diagonal matrices. Also the case of higher order semiseparability ranks is included. More precisely, instead of the traditional QR-iteration, a QH-iteration will be used. The QH-factorization is characterized by a unitary matrix Q and a Hessenber...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1997
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(97)00008-4